Sign-Change Diminishing Systems of Functions of Many Variables
نویسندگان
چکیده
منابع مشابه
Infinitely many solutions for a bi-nonlocal equation with sign-changing weight functions
In this paper, we investigate the existence of infinitely many solutions for a bi-nonlocal equation with sign-changing weight functions. We use some natural constraints and the Ljusternik-Schnirelman critical point theory on C1-manifolds, to prove our main results.
متن کاملMultiplicity of Positive Solutions of laplacian systems with sign-changing weight functions
In this paper, we study the multiplicity of positive solutions for the Laplacian systems with sign-changing weight functions. Using the decomposition of the Nehari manifold, we prove that an elliptic system has at least two positive solutions.
متن کاملa contrastive study of rhetorical functions of citation in iranian and international elt scopus journals
writing an academic article requires the researchers to provide support for their works by learning how to cite the works of others. various studies regarding the analysis of citation in m.a theses have been done, while little work has been done on comparison of citations among elt scopus journal articles, and so the dearth of research in this area demands for further investigation into citatio...
Recovery of Functions of Many Variables via Compressive Sensing
Recovery of functions of many variables from sample values usually suffers the curse of dimensionality: The number of required samples scales exponentially with the spatial dimension. In order to avoid this severe bottleneck, one needs to impose further structural properties of the function to be recovered apart from smoothness. Here, we build on ideas from compressive sensing and introduce a f...
متن کاملstudy of hash functions based on chaotic maps
توابع درهم نقش بسیار مهم در سیستم های رمزنگاری و پروتکل های امنیتی دارند. در سیستم های رمزنگاری برای دستیابی به احراز درستی و اصالت داده دو روش مورد استفاده قرار می گیرند که عبارتند از توابع رمزنگاری کلیددار و توابع درهم ساز. توابع درهم ساز، توابعی هستند که هر متن با طول دلخواه را به دنباله ای با طول ثابت تبدیل می کنند. از جمله پرکاربردترین و معروف ترین توابع درهم می توان توابع درهم ساز md4, md...
ذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1994
ISSN: 0021-9045
DOI: 10.1006/jath.1994.1050